Automaticity and Invariant Measures of Linear Cellular Automata
نویسندگان
چکیده
منابع مشابه
Invariant Measures for Bipermutative Cellular Automata
A right-sided, nearest neighbour cellular automaton (RNNCA) is a continuous transformation Φ : A−→A determined by a local rule φ : A{0,1}−→A so that, for any a ∈ A and any z ∈ Z, Φ(a)z = φ(az, az+1). We say that Φ is bipermutative if, for any choice of a ∈ A, the map A ∋ b 7→ φ(a, b) ∈ A is bijective, and also, for any choice of b ∈ A, the map A ∋ a 7→ φ(a, b) ∈ A is bijective. We characterize ...
متن کاملProbabilistic cellular automata, invariant measures, and perfect sampling
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be viewed as a Markov chain whose ergodicity is investigated. A classical cellular automaton (CA) is a particular case of PCA. For a 1-dimensional CA, we prove that ergodicity is equivalent to nilpotency, and is therefore u...
متن کاملConservation Laws and Invariant Measures in Surjective Cellular Automata
We discuss a close link between two seemingly different topics studied in the cellular automata literature: additive conservation laws and invariant probability measures. We provide an elementary proof of a simple correspondence between invariant full-support Bernoulli measures and interaction-free conserved quantities in the case of onedimensional surjective cellular automata. We also discuss ...
متن کاملAction of Cellular Automata on shift-invariant measures
Let M = Zd × Nd and let A be a finite alphabet. Generally a cellular automaton is studied as a N-action on AM endowed with the product topology without worrying about the M-action σ. However this topology privileges the origin whereas in the majority of applications all the cells have the same importance. One point of view can be to address the M× N-action (σ, F ) in order to put emphasize the ...
متن کاملAutomata on ordinals and automaticity of linear orders
We investigate structures recognizable by finite state automata with an input tape of length a limit ordinal. At limits, the set of states which appear unboundedly often before the limit are mapped to a limit state. We describe a method for proving nonautomaticity and determine the optimal bounds for ranks of linear orders recognized by such automata.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Mathematics
سال: 2019
ISSN: 0008-414X,1496-4279
DOI: 10.4153/s0008414x19000488